PRUF a meaning representation language for natural languages
نویسنده
چکیده
PRUF--an acronym for Possibilistie Relational Universal Fuzzy--is a meaning representation language for natural languages which departs from the conventional approaches to the theory of meaning in several important respects. First, a basic assumption underlying PRUF is that the imprecision that is intrinsic in natural languages is, for the most part, possibilistic rather than probabilistic in nature. Thus, a proposition such as "Richard is tall" translates in PRUF into a possibility distribution of the variable Height (Richard), which associates with each value of the variable a number in the interval [0,1 ] representing the possibility that Height (Richard) could assume the value in question. More generally, a proposition, p, translates into a procedure, P, which returns a possibility distribution, II P, with P and 1-I P representing, respectively, the meaning of p and the information conveyed by p. In this sense, the concept of a possibility distribution replaces that of truth as a foundation for the representation of meaning in natural languages. Second, the logic underlying PRUF is not a two-valued or multivalued logic, but a fuzzy logic, FL, in which the truth-values are linguistic, that is, are of the form true, not true, very true, more or less true, not very true, etc., with each such truth-value representing a fuzzy subset of the unit interval. The truth-value of a proposition is defined as its compatibility with a reference proposition, so that given two propositions p and r, one can compute the truth o fp relative to r. Third, the quantifiers in PRUF--like the truth-values--are allowed to be linguistic, i.e. may be expressed as most, many, few, some, not very many, almost all, etc. Based on the concept of the cardinality of a fuzzy set, such quantifiers are given a concrete interpretation which makes it possible to translate into PRUF propositions exemplified by "Many tall men are much taller than most men," "All tall women are blonde is not very true," etc. The translation rules in PRUF are of four basic types: Type I--pertaining to modification; Type II--pertaining to composition; Type In--pertaining to quantification; and Type IV--pertaining to qualification and, in particular, to truth qualification, probability qualification and possibility qualification. The concepts of semantic equivalence and semantic entailment in PRUF provide a basis for question-answering and inference from fuzzy premises. In addition to serving as a foundation for approximate reasoning, PRUF may be employed as a language for the representation of imprecise knowledge and as a means of precisiation of fuzzy propositions expressed in a natural language.
منابع مشابه
PRUF - A Language for the Representation of Meaning in Natural Languages
PRUF is based on the premise tha t the uncer t a i n t y in the i n t e r p r e t a t i o n o f a p r o p o s i t i o n in a n a t u r a l language i s p o s s i b i l i s t i c ra the r than prob a b i l i s t i c i n na tu re . This imp l i es tha t a p ropos i t i o n , p, of the form "X is F" where X is the name of an ob jec t and F is a fuzzy subset of a universe of d iscourse U, t r a...
متن کاملFuzzy query interface for a business database
Managers, in today's corporations, rely increasingly on the use of databases to obtain insights and updated information to make their decisions. This paper describes a flexible query interface based on fuzzy logic. Hence, queries in natural language with pre-defined syntactical structures are performed, and the system uses a fuzzy natural language process to provide answers. This process uses t...
متن کاملTowards a Mathematical and Computational Theory of Meaning in Natural Languages
In one hand, the meaning of natural languages is often described with basic semantic features and a boolean composition of these features. However, this approach is not sufficient to describe more deeply the meaning of linguistic units. In the other hand, the semantic of computer languages often starts from Church’s λ-calculus and walks up to more abstract levels. In this communication, is ...
متن کاملDAG Automata for Meaning Representation
Languages of directed acyclic graphs (DAGs) are of interest in Natural Language Processing because they can be used to capture the structure of semantic graphs like those of Abstract Meaning Representation. This paper gives an overview of recent results on a family of automata recognizing such DAG languages.
متن کاملMeaning Representation for Knowledge Sharing in Practical Machine Translation
Knowledge-based machine translation can be viewed as the problem of extracting and representing the meaning of a text and generating a translation in a target language using the meaning representation. Meaning extraction requires the integration of information present explicitly in a text with common sense and domain knowledge given to the system. Thus, integrating linguistic knowledge of each ...
متن کامل